Local Structures in Polyhedral Maps on Surfaces, and Path Transferability of Graphs

نویسنده

  • RYUZO TORII
چکیده

We extend Jendrol’ and Skupień’s results about the local structure of maps on the 2-sphere: In this paper we show that if a polyhedral map G on a surface M of Euler characteristic χ(M) ≤ 0 has more than 126|χ(M)| vertices, then G has a vertex with ”nearly” non-negative combinatorial curvature. As a corollary of this, we can deduce that path transferability of such graphs are at most 12. keyword 1. Polyhedral maps, Embedding, Light vertex, Combinatorial curvature, Path transferability

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Oblique Graphs

The main issue of this work is to investigate asymmetric structures in graphs. While symmetry structures in graphs are well observed, the opposite question has not been investigated deeply so far. It is known from a theorem of Wright, that almost all graphs are asymmetric. The class of asymmetric graphs is restricted further by forbidding even local symmetries. The main question is to determine...

متن کامل

Using generic programming for designing a data structure for polyhedral surfaces

Software design solutions are presented for combinatorial data structures, such as polyhedral surfaces and planar maps, tailored for program libraries in computational geometry. Design issues considered are exibility, time and space eeciency, and ease-of-use. We focus on topological aspects of polyhedral surfaces and evaluate edge-based representations with respect to our design goals. A design...

متن کامل

Light classes of generalized stars in polyhedral maps on surfaces

A generalized s-star, s ≥ 1, is a tree with a root Z of degree s; all other vertices have degree ≤ 2. Si denotes a generalized 3-star, all three maximal paths starting in Z have exactly i + 1 vertices (including Z). Let M be a surface of Euler characteristic χ(M) ≤ 0, and m(M) := b 5+ √ 49−24χ(M) 2 c. We prove: (1) Let k ≥ 1, d ≥ m(M) be integers. Each polyhedral map G on M with a k-path (on k ...

متن کامل

Contractible Hamiltonian cycles in Polyhedral Maps

We present a necessary and sufficient condition for existence of a contractible Hamiltonian Cycle in the edge graph of equivelar maps on surfaces. We also present an algorithm to construct such cycles. This is further generalized and shown to hold for more general maps. AMS classification : 57Q15, 57M20, 57N05.

متن کامل

Light stars in large polyhedral maps on surfaces

It is well known that every polyhedral map with large enough number of vertices contains a vertex of degree at most 6. In this paper the existence of stars having low degree sum of their vertices in polyhedral maps is investigated. We will prove: if G is a polyhedral map on compact 2-manifold M with non-positive Euler characteristic (M) and G has more than 149| (M)| vertices then G contains an ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009